Direct energy functional minimization under orthogonality constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Direct energy functional minimization under orthogonality constraints.

The direct energy functional minimization problem in electronic structure theory, where the single-particle orbitals are optimized under the constraint of orthogonality, is explored. We present an orbital transformation based on an efficient expansion of the inverse factorization of the overlap matrix that keeps orbitals orthonormal. The orbital transformation maps the orthogonality constrained...

متن کامل

Energy Minimization under Constraints on Label Counts

Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may know the number of pixels or voxels which can be assigned to a particular label. For instance, in the reconstruction problem, we may know size of the object to be reconstructed. Such label count constraints are extremely power...

متن کامل

Power Minimization under QoS Constraints

QoS has been often addressed in multimedia, video, and networking research communities, but rarely in the design community. Our goal is to introduce the rst system design technique for comprehensive quality-of-service (QoS) low power synthesis. Speci cally, we study how to e ciently exploit the trade-o between the system cost and energy consumption in real-time systems that address packet-based...

متن کامل

Submodular Minimization Under Congruency Constraints

Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint types under which SFM remains efficiently solvable. The arguably most relevant non-trivial constraint class for which polynomial SFM algorithms are known are...

متن کامل

Least-Squares Minimization Under Constraints

These algorithms are, however, not designed to perform least-squares minimization under hard constraints. This short report outlines two very simple approaches to doing this to solve problems such as the one depicted by Fig. 1. The first relies on standard Lagrange multipliers [Boyd and Vandenberghe, 2004]. The second is inspired by inverse kinematics techniques [Baerlocher and Boulic, 2004] an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Chemical Physics

سال: 2008

ISSN: 0021-9606,1089-7690

DOI: 10.1063/1.2841077